Expected rank in antimatroids ✩ Gary

نویسنده

  • Gary Gordon
چکیده

We consider a probabilistic antimatroid A on the ground set E, where each element e ∈ E may succeed with probability pe . We focus on the expected rank ER(A) of a subset of E as a polynomial in the pe . General formulas hold for arbitrary antimatroids, and simpler expressions are valid for certain well-studied classes, including trees, rooted trees, posets, and finite subsets of the plane. We connect the Tutte polynomial of an antimatroid to ER(A). When S is a finite subset of the plane with no three points collinear, we derive an expression for the expected rank that has surprising symmetry properties. Corollaries include new formulas involving the beta invariant of subsets of S and new proofs of some known formulas.  2003 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DIMACS Technical Report 2002 - 07 February 2002 Expected rank in antimatroids

We consider a probabilistic antimatroid A on the ground set E, where each element e ∈ E may succeed with probability pe. We focus on the expected rank ER(A) of a subset of E as a polynomial in the pe. General formulas hold for arbitrary antimatroids, and simpler expressions are valid for certain well-studied classes, including trees, rooted trees, posets, and finite subsets of the plane. We con...

متن کامل

On Brylawski's Generalized Duality

We introduce a notion of duality—due to Brylawski—that generalizes matroid duality to arbitrary rank functions. This allows us to define a generalization of the matroid Tutte polynomial. This polynomial satisfies a deletion-contraction recursion, where deletion and contraction are defined in this more general setting. We explore this notion of duality for greedoids, antimatroids and demi-matroi...

متن کامل

A Invariant for Greedoids and Antimatroids

We extend Crapo’s β invariant from matroids to greedoids, concentrating especially on antimatroids. Several familiar expansions for β(G) have greedoid analogs. We give combinatorial interpretations for β(G) for simplicial shelling antimatroids associated with chordal graphs. When G is this antimatroid and b(G) is the number of blocks of the chordal graph G, we prove β(G) = 1− b(G).

متن کامل

Linear Relations for a Generalized Tutte Polynomial

Brylawski proved the coefficients of the Tutte polynomial of a matroid satisfy a set of linear relations. We extend these relations to a generalization of the Tutte polynomial that includes greedoids and antimatroids. This leads to families of new identities for antimatroids, including trees, posets, chordal graphs and finite point sets in Rn. It also gives a “new” linear relation for matroids ...

متن کامل

The forbidden minor characterization of line-search antimatroids of rooted digraphs

An antimatroid is an accessible union-closed family of subsets of a 0nite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003